Method and apparatus for updating a group key in a wireless communication system

ABSTRACT

The present invention relates to a method and apparatus for updating a key for encrypting multicast data in a wireless communication system. The method of the present invention is characterized by comprising: an information receiving step of receiving information on a group entry time and a group exit time from users who have newly entered an arbitrary group including at least one subgroup; a grouping step of grouping the users using the information on the group entry time and the group exit time; and a key transmission step of either transmitting, to the newly-entered users, keys related to the group and the subgroups, or updating, for the remaining users of the subgroups, both the key related to the subgroup to which the user exiting the group belongs and the key of the group and then transmitting the updated keys to the users of the subgroups.

TECHNICAL FIELD

The present invention relates to a group key update method and apparatus in a wireless communication system. In more particular, the present invention relates to a key update method and apparatus for sorting the users departed a group at the same into another group and, if necessary, updating a key of the group in a batch manner.

BACKGROUND ART

Multicast is a technique for sending data efficiently to a plurality of persons simultaneously with the least network bandwidth. Unlike unicast consuming n channels for transmitting to n users, the multicast makes it possible to transmit data to n users with 1/n channels required for the unicast. Such a multicast service is capable of providing application services such as pay TV, online game, and video conference efficiently. However, since all of the users within the reception range can receive the data, there is a need of an access control technique.

Such an access control technique is implemented in the way of accomplishing the security goal of the multicast data by encrypting the multicast data and sharing a group key among the group members. In the access control technique, a Key Distribution Center (KDC) is responsible for managing the group key.

For the security of the multicast data, it is necessary to guarantee the forward secrecy after the key update and the backward secrecy before the key update and thus the KDC has to update the key when there is any change in group members due to entry and departure of group users. The frequent key updates caused by the dynamicity of the group members incur high communication and security costs.

There is therefore a need of an efficiently group key reconfiguration method for used in the wireless communication system using multicast.

DISCLOSURE OF INVENTION Technical Problem

The present invention has been conceived in an effort to solve the above problem and aims to provide a key update method and apparatus that is capable of sorting the users departed a group at the same time into another group and, if necessary, updating the keys of the group in a bundle.

Solution to Problem

In accordance with an aspect of the present invention, a key update method of encrypting multicast data in a wireless communication system includes receiving information on group entry times and group entry times of users entering newly a certain group including at least one subgroup, sorting the users into the at least one subgroup based on the group entry and departure times, sending the users a group key of the group and subgroup keys of the corresponding subgroups respectively, and updating, when a user departs from the group, the subgroup key of the subgroup from which the user departs and the group key and transmitting the updated subgroup key and group key to the users remained in the group.

In accordance with another aspect of the present invention, an apparatus of updating and delivering keys encrypting multicast data in a wireless communication system includes an interface unit which receives information on group entry times and group entry times of users entering newly a certain group including at least one subgroup and a control unit which sorts the users into the at least one subgroup based on the group entry and departure times, sends the users a group key of the group and subgroup keys of the corresponding subgroups respectively, and updates, when a user departs from the group, the subgroup key of the subgroup from which the user departs and the group key and transmitting the updated subgroup key and group key to the users remained in the group.

Advantageous Effects of Invention

The key update method and apparatus of the present invention sorts the users departed a group at the same time into groups and, if necessary, updates the key of the group. This is capable of reducing indirect cost for storing keys and removes unbalance of the key tree so as to achieve high efficiency in updating keys through batch key update.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a diagram illustrating an exemplary flat tree structure.

FIG. 2 is a diagram illustrating an exemplary Logical Key Hierarchy (LKH) structure as one of the tree-based key management.

FIG. 3 is a diagram illustrating an exemplary structure of the Departure Independent Key Tree (DIKT).

FIG. 4 is a diagram illustrating an exemplary structure of the Departure Dependent Key Tree (DDKT) according to an embodiment of the present invention.

FIG. 5 is a flowchart illustrating English algorithm of Protocol A supporting forward secrecy according to the first embodiment of the present invention.

FIG. 6 is a flowchart illustrating the procedure of Protocol A according to the first embodiment of the present invention.

FIG. 7 is a flowchart illustrating English algorithm of protocol B supporting both the backward secrecy and forward secrecy according to the second embodiment of the present invention.

FIG. 8 is a flowchart illustrating the procedure of Protocol B according to the second embodiment of the present invention.

FIG. 9 is a flowchart illustrating English protocol of the insert function according to an embodiment of the present invention.

FIG. 10 is a flowchart illustrating the procedure for the KDC to execute the insert function.

FIG. 11 is a flowchart illustrating the English protocol of the Insert function (InsertToShortTermGroup) according to an embodiment of the present invention.

FIG. 12 is a flowchart illustrating the procedure for the KDC to execute the short term insert function (InsertToShortTermGroup)

FIG. 13 is a flowchart illustrating the procedure for the KDC to execute Protocol A and Protocol B according to an embodiment of the present invention.

FIG. 14 is a block diagram illustrating a configuration of the KDC according to an embodiment of the present invention.

FIG. 15 is a diagram illustrating the key distribution and assignment procedure according to Protocol A and Protocol B according to an embodiment of the present invention.

MODE FOR THE INVENTION

The present invention is applicable to a Group Controller (GC) or a Key Distribution Center (KDC) (hereinafter, interchangeably used with key distribution apparatus) managing the keys encrypted for security in the multicast communication.

The GC or KDC managing keys for secure communication may be any of HSS, HLR, UE, eNB, and MME in the 3GPP system and all entities using multicast in other systems than 3GPP system. This is because the mobile terminal may work as the host of communication in the future services. That is, unlike the conventional services in which the operator owning the KDC such as server is the host, the future services may be hosted by mobile terminal such as UE in the prediction of multicast services of the users. Accordingly, a mobile device has to have a KDC for secure communication and perform update dynamically in adaptation to the mobile environment. In the case of applying the present invention, it is possible to determine the key update timing capable of minimizing cost by taking notice of the communication and security costs depending on the service.

The present invention is applicable to all the types of group communication-capable devices updating keys periodically in the situation of communicating based on the group key shared among group members for secure group communication.

Exemplary embodiments of the present invention are described with reference to the accompanying drawings in detail. The same reference numbers are used throughout the drawings to refer to the same or like parts. Detailed description of well-known functions and structures incorporated herein may be omitted to avoid obscuring the subject matter of the present invention.

The batch key update method, apparatus, and system of the present invention are applicable to the server, terminal, and KDC responsible for distributing keys. If the key updated time arrives, the KDC assigns the keys to the group users who manage the keys assigned by the KDC. For secure transmission, the multicast data are encrypted with a group key shared among the group users.

Suppose that a user departs the group. Since the departed user has the group key for use in receiving a broadcast service, it is necessary to generate a new key for maintaining the secrecy from the departed user. The KDC generates a new key and delivers the new key to the group members. The key is encrypted with the individual key of each user for delivery.

In this way, the new group key is delivered to the group with exception of the departed user. Accordingly, the data secrecy can be maintained with the group key which is not known to the departed user.

Descriptions are made of key update methods based on the key structure, key update time, and the user arrangement in the key tree briefly hereinafter.

First, a key structure-based key update method is described.

The key structure-based key update method may be classified into one of flat tree and tree-based key management.

A description is made of the flat tree first. FIG. 1 is a diagram illustrating an exemplary flat tree structure.

As described above, if a new user enters or an old user departs, the KDC generates a new key to maintain the secrecy of the data and delivers the newly generated key to the group members. The flat tree structure-based delivery method transmits the group key encrypted with the Individual Key (IK) of each user unlike the LKH to be described later.

As shown in FIG. 1, the flat tree is composed of two layers, i.e. Group Key and IK without intermediate KEK unlike LKH to be described later.

However, since the new group key is encrypted with IKs of the individual users who have not departed, if one of n members departs, n−1 messages have to be generated for the users and thus, as the number of devices increases, it is likely to cause scalability problem.

FIG. 2 is a diagram illustrating an exemplary Logical Key Hierarchy (LKH) structure as one of the tree-based key management.

As shown in the flat tree, if a new device enters or if an old device departs, the KDC generates a new key to maintain the secrecy of the data and delivers the newly generated key to the group members.

Unlike the flat tree encrypting the new group key with the individual keys (IK), the LKH transmits the key generated with the key encryption key (KEK) located in the middle of the hierarch more efficiently.

In the flat tree, the new group key is encrypted with individual IKs of the devices and thus, if one of n members departs, n−1 messages are required for transmitting the new key to the devices, which may causes scalability problem as the number of devices increases.

In order to solve this problem, the tree-based key management has been developed, and the Logical Key Hierarchy (LKH) is used frequently as one of the tree-based key management techniques. The LKH is a key update method for transferring the group to a plurality of users using KEK on a logical hierarchical layer. This is capable of transfer the new group key to a plurality of users so as to reduce the number of required messages as compared to the method of transmitting the key to the individual users.

The group key is managed by the key layer and, when it is transmitted for security, encrypted with a key of one layer away. An exemplary LKH-based key tree is described with reference to FIG. 2.

In FIG. 2, g denotes the group key for use in encrypting data; and k0, k00, k01, and k02 denote KEKs for use in encrypting a higher layer key in LKH.

In FIG. 2, if the users 203 depart the group, it is necessary to update the keys gk and k0 in such a way of gk→gk′ and k0→k0′. Since the new key generation method is out of the scope of the present invention, detailed description thereon is omitted herein. Meanwhile, k00 is not necessary to update because all of the users knowing the key have departed. For secure delivery of gk′ and k0′, the GC multicasts the following messages.

KDC->Users: M1=Enc(gk′, k0′)

KDC->Users: M2=Enc(gk′, k02)

KDC->Users: M3=Enc(k0′, k01);

Here, MI denotes the encrypted message, and Enc(a,b) denotes that the data a has been encrypted with b.

The users received the messages decrypt the multicast messages to acquire the newly updated keys as follows.

gk′=Dec(M1, k0′)

gk′=Dec(M2, k02)

k0′=Dec(M3, k01)

Here, Dec(a,b) denotes that data a is decrypted with key b.

A description is made of the key update method based on the key update timing.

The key update timing-based key update method includes: Individual rekeying and Batch rekeying.

Among them, the individual rekeying is described first.

The aforementioned access control technology helps the service manager manage a plurality of users in combination with multicast. However, suppose a situation where one of the users is not managed any longer. Since the user who cannot receive the service any longer has the TEK for use in receiving the user management message, it is necessary to generate a new key for protecting the secrecy (confidentiality) from the user. The KDC generates a new key and deliver the key to the users.

The delivery is made in such a way of encrypting the new TEK with IK and KEK of each user. In this case, the users receiving the management service may receive the new TEK while the user who does not receive the service any more cannot receive the new TEK. Afterward, the secrecy can be protected through the user management service using the newly updated TEK.

The key management method in which the key is updated immediately when there is a change in members of a group receiving the service is referred to as Individual Rekeying.

In the Individual Rekeying, the number of messages to be transmitted for maintaining the secrecy is equal to the number of users of which IKs are sued for encrypting the new TEK. This can be normalized in such a way that if one of n users departs the service total n−1 messages are necessary for transmitting the new keys to the remained users.

Although there is no problem when the number of user is small, if the number of users increases, this is likely to incur scalability. Meanwhile, the periodic batch rekeying proposed for updating the key efficiently is very efficient to update the key for the a large group of users with compromise of security to some extent. Unlike the conventional individual rekeying, KDC or GC waits, although some users enter or depart the group, for a predetermined time to update the key instead of updating the key immediately.

In the periodic rekeying method, the KDC may replace the departed user with the newly entered user such that the key path including the users departed the service is updated at a time and the key to be updated on the key path from the leaf to the root may be shared by several paths and thus the number of keys to be updated decreases significantly.

A description is made of the key update method based on the user arrangement on the key tree in performing batch rekeying hereinafter.

The key update method based on the user arrangement on the key tree may be classified into one of Departure Independent Key Tree (DIKT) and Departure Dependent Key Tree (DDKT).

Among them, the Departure Independent Key Tree (DIKT) is described first.

FIG. 3 is a diagram illustrating an exemplary structure of the Departure Independent Key Tree (DIKT).

The DIKT is the key tree structured independently from the departure times of the users as a conventional method for building a key tree. FIG. 3 shows a normal key tree in which the group members are arranged randomly regardless of their group departure times.

In FIG. 3, the triangles and quadrangles denote the users included in the group and it is assumed that the users represented by the same polygonal shape depart the group at the same time in the batch rekeying.

For example, if the users 101 and 102 depart the group, the group communication data have to be blocked to the departed users and thus the keys k00, k02, k0, and gk known to the departed user 101 and 102 have to be updated and redelivered using the above-described LKH method.

Meanwhile, the users departing the group may be distributed on the key tree which is worst case in the batch key update method as shown FIG. 3. In this case, most keys on the tree have to be updated inefficiently. Typically, the users are distributed evenly, it is likely that the worst case occurs frequently. This increases the communication cost for updating the group key. However, since it is impossible to know the departure times of the users, it is not easy to improve the throughput with KDC in the periodic batch key update method.

Meanwhile, the Departure Dependent Key Tree (DDKT) determines the position at which the user is arranged on the basis of the departure time of the user.

In order to build the key tree optimized to the communication cost, the present invention uses the departure times of the users. Such a departure time-dependent key tree is referred to as Departure Dependent Key Tree (DDKT). The DDKT acquires the information on the departure times of the user with priority and arranges the users to be optimized before departing the group with a key update protocol. In the case of key update at the leaf level of the KDC tree, if it is possible to arrange the users departing at the same time together, this minimize the number of keys shared by the departing users. That is, the number of keys to be updated is minimized, resulting in efficient key update.

FIG. 4 is a diagram illustrating an exemplary structure of the Departure Dependent Key Tree (DDKT) according to an embodiment of the present invention.

Unlike FIG. 3 showing the example of DIK as DIKT arranging the group members randomly regardless of their group departure times, FIG. 4 shows an exemplary of DDKT building the key tree in consideration of the group departure time of the group members.

In FIG. 4, the same shapes denote the users departing the group at the same time in batch rekeying. That is, since the users represented by the same shape depart at the same time, the method of FIG. 4 which is proposed in the present invention is very cost-effective as compared to the DIKT depicted in FIG. 3.

In the example of DIKT of FIG. 3, if the users 101 and 102 represented by the same triangle shape depart from the group, the keys k00, k0, k02, and gk have to be updated to k00′, k0′, k02′, and gk′ which have to be delivered through multicast as follows.

Enc(gk′, k0′)∥Enc(gk′, k02′)∥Enc(k0′, k00′)∥Enc(k0′, k01)∥Enc(k00′,IK)∥Enc(k02′,IK)∥Enc(k02′,IK)

In contrast, if the users 401 represented by the same triangle shape are departed from the group in DDKT of FIG. 4, only the three keys of k00, k0, and gk are updated and multicast.

Enc(gk′, k0′)∥Enc(gk′, k02′)∥Enc(k0′, k01′)

Comparing the cases of FIGS. 3 and 4 with each other, the Departure

Dependent Key Tree of FIG. 4 is capable of reducing the number of keys to be updated and the number of messages required for key update.

Descriptions are made of the problem of the conventional technology and the proposal of the present invention hereinafter.

It is assume that the users are sorted into {circumflex over (b)} sets, i.e. {circumflex over (ω)}₀, {circumflex over (ω)}₁, . . . , {circumflex over (ω)}_({circumflex over (b)}1) and the users departing at the same time belongs to the same set and the users depart by set in a temporal order. Also it is assumed that a certain user enters at time m{circumflex over (b)}+p and departs at time n{circumflex over (b)}+q (n>m, 0<=p, q<^({circumflex over (b)}), and m, n, p, and q are integers).

In the conventional DDKT technology, if a user enters at time m{circumflex over (b)}+p, a number of users decreases in the set {circumflex over (ω)}_(p) instantaneously. Because the user departs the set {circumflex over (ω)}_(p). Then the key tree becomes unbalanced and the unbalance of the key tree may cause extra communication overhead in the process of group key update.

Accordingly, in the conventional DDKT technology, the entry user is included in {circumflex over (ω)}_(p) and the moves the user to {circumflex over (ω)}_(q) before the time of {circumflex over (b)} the user departs. This process progresses with Move function and incurs extra overhead. That is, since it is necessary to search for the users to depart in a period, move them to another set, and deliver a sub-group key of the new group, this incurs operation overhead and communication overehad.

In the technology proposed by the present invention, the user is included in {circumflex over (ω)}_(q) initially without use of Move function. In this case, there may be the overhead caused by the unbalance of the key tree but not the overhead caused by the Move function, resulting in reduction of communication and operation costs.

Preferred embodiments of the present invention are described in detail hereinafter with reference to accompanying drawings.

Prior to explaining the present invention, the mathematical symbols necessary for describing the operation principle of the embodiments of the present invention are defined as shown in table 1.

TABLE 1 b: number of partition ρ: rekey interval e(u): time when user u enter the group d(u): time when user u departure the group τ(u ): time when user belong to the group. i.e., d(u) − e(u). T: one period (T=b × ρ) r(j) (0 ≦ j ≦ b − 1): j^(th) time point. Absolute time, initially having value of r(j)=jρ, and updated to r(j)=r(j)+T if the rekey process ends when t=kT+jρ. ω_(i) (0 ≦ j ≦ b − 1): set of users to depart at rekey interval after i^(th) time since now. They are processed at i^(th) rekey interval from current rekey interval. - ω₀ : set of users departed at rekey interval right before. Processed immediately right now. - ω_(b) : set of users distant over at least one interval from now as departure time. σ₍₀₎, σ₍₁₎, σ₍₂₎, . . . , σ_((b−1)): b sets acquired by dividing entire user set and indicates absolute positions of partitions. ( σ_((j)) includes users of which departure times are between kT+(j−1)ρ and kT+jρ for non-negative integer k. In the case of Protocol B, there exists users of which τ(u) is equal to or greater than T among the users.) σ_(s) : (used only in protocol B) set of users of which τ(u ) is less than T. D_(r(j)): when r(j−1) < t ≦ r(j), set of users departing the group at time t. R_(r(j)): (used only in protocol A) set of user remained without departing the group at time t when r(j−1< t ≦ r(j) among users of σ_(j). That is, R_(r(j)) ^(t) = σ_(j)\D_(r(j)). R_(r(j)) ^(t) : (used only in protocal B) set of users remained without departing the group at time t when r(j−1< t ≦ r(j). That is, R_(r(j)) ^(t) = σ_(j)\D_(r(j)). U_(r(j)): entire set of users belonging to to group, when r(j−1) < t ≦ r(j) J_(r(j)): entire set of users entered the group newly, when r(j−1) < t ≦ r(j)

In the present invention, the users (or terminals such as UEs) are sorted into partitions (or groups) by service reception start time. For this purpose, when entering the group, the user sends the KDC the information on user's group entry time and e(u) and group departure time d(u).

The present invention proposes two types of batch key update and reconfiguration systems referred to as protocol A and protocol B, respectively. The Protocol A supports forward secrecy after the key update at the batch level, and the protocol B supports two-way secrecies after and before the key update.

Here, the forward secrecy denotes the situation where the device departed from the group cannot access the group key any more. In contrast, the backward secrecy denotes the situation where the device entered the group newly cannot access the key used before entering the group.

The subsets (or partitions) are updated at every rekeying interval of ρ in the following order.

σ₀→σ₁→σ₂→ . . . →σ_(b−1)→σ₀→σ₁→ . . . .

The individual subsets may use a key management method with the tree-based structure on the key topology, and the subgroup key works as a role of the group key as the root key in the tree-based structure of the subgroup. Accordingly, the subgroup key k_(σ) _(j) is connected to the subgroup σ_(j) directly.

A description is made of the operation principle of the protocol A (forward secrecy) and protocol B (backward secrecy) for short term users with reference to a flowchart hereinafter. Also, the operation principle of protocol A and protocol B are described with reference to FIG. 15. First, the protocol A cording to the first embodiment of the present invention is described.

First Embodiment Protocol A

The English algorithm of Protocol A according to the first embodiment of the present invention supporting the forward secrecy is shown in table 2 and depicted into a flowchart as shown in FIG. 5.

TABLE 2 1: if clock reaches r (j) then (Step 502) 2:  Classify σ_(j): departed users D_(r( j)) = ω₀∩σ_(j), remaining users R_(r( j)) =  σ_(j)\ω₀; (

 503) 3:  Delete D_(r(j)); (Step 504) 4:  Collect joining users J_(r(j)) = {u ∈ N | r(j − 1) < e (u) ≦ r (j)}; (Step  505) 5:  Update P_(r(j)) → P_(r(j)+ρ) considering the batch request: U_(r(j+1)) =  (U_(r(j))\ω₀) ∪ J_(r(j)); (

 506) 6:  Insert: J_(r(j)) at r(j); (Step 507) 7:  r(j)

 r(j) + T; (Step 507) 8: end if

The English Protocol A may be expressed in the Korean Protocol as shown in table 3.

TABLE 3 1.

2.

3.

4.

5.

6.

7.

8.

The Protocol A presented in tables 2 and 3 and FIG. 5 can be described briefly as follows. The KDC starts the process at time r(j) at step 502 of FIG. 5. The KDC sorts the users departed in the current interval among the users included in {circumflex over (ω)}_(j) into D_(r(j)) and the remained users into R_(r(j)) at step 503 of FIG. 5. Next, the KDC disjoins the users in the D_(r(j)) at step 504 of FIG. 5. The KDC includes the users entering in the current interval in the J_(r(j)) at step 505. The KDC updates the entire sets of the users at step 506 of FIG. 5. The KDC sorts the users in the J_(r(j)) into an appropriate partition among {circumflex over (ω)}₀, {circumflex over (ω)}₁, . . . , {circumflex over (ω)}_({circumflex over (b)}−1) depending on their departure time at step 507 of FIG. 5.

The procedure of protocol A according to the first embodiment of the present invention is depicted into a flowchart as shown in FIG. 6. Referring to FIG. 6, the KDC waits for the arrival of the rekey time at step 601. If the rekey time is the time when the rekeying occurs. Here, the rekeying denotes the behavior of updating the key of the group changed in group members.

The KDC sorts the users departed from the current subgroup in the current rekey interval into D and the remained users into R. The rekey interval denotes the duration between the current rekey time and the previous rekey time right before.

The KDC deletes the departed users D at step 603.

The KDC defines the users entered the group in the rekey interval as J. The KDC updates the group key and sorts the users of J into a subgroup of the users departed at the same time. That is, the rekey time is divided into the total number of subgroups sorted the users into the remained group. If the new entry J is sorted into the group, the KDC uses the Insert Function which is described later.

The KDC moves the current rekey time and the subgroup to the next interval at step 606. That is, the KDC adds 1 to the update time to move to the next interval and the next update time to the subgroup remained after diving the next updated time with the total number of subgroups.

In the protocol A according to the first embodiment of the present invention, the keys to be updated are the keys from the group key k_(σ) _(j) of the departing users and the TEK. That is, since the keys owned by the users departed are all updated, the keys cannot be used and thus forward secrecy is supported.

However, once the newly entered users are assigned the key, the key can be used until it is changed. For example, the user A entered the group σ(j+i)modb between kT+(j−1)ρ and kT+jρ is assigned k_(σ) _((j+1)modb) which is the key generated at (k−1)T+(j+i)ρ and updated at, kT(j+i)ρ. Then the user A receives a message Enc(TEK,k₁)∥Enc(k₁,k₂)∥ . . . ∥Enc(k_(h),k_(σ) _((j+1)modb)) multicast at time (k−1)T+(j+i)ρ and then the data (encrypted with TEK) transmitted between (k−1)T+(j+i)ρ and (k−1)T+(j+i+1)ρ and enters the group to check the received TEK and data with k_(σ) _((j+1)modb) . Accordingly, the backward security is not guaranteed during the time of up to T−ρ.

Second Embodiment Protocol B

A description is made of the protocol B according to the first embodiment of the present invention hereinafter.

The English algorithm of protocol B according to the second embodiment of the present invention supporting both the backward and forward secrecies is shown in table 4 and depicted into a flowchart as shown in FIG. 7.

TABLE 4  1: if clock reaches r(j) then (Step 702)  2:  Classify σ_(j): departed users D_(r( j)) = ω₀∩σ_(j), remaining users R_(r(j)) ^(l) =  σ_(j)\ω₀; (Step 703)  3:  Delete D_(r(j)); (Step 704)  4:  Collect joining users J_(r(j)) = {u ∈ N | r( j − 1) < e (u) ≦ r ( j)}; (Step  705)  5:  Update P_(r(j)) → P_(r(j)+ρ) considering the batch request: U_(r( j+1) ₎ =  (U_(r(j))\ω₀) ∪ J_(r(j)); (Step 706)  6:  Update the short-term user group σ_(s) = σ_(s)\(σ_(s) ∩ ω₀); (Step 707)  7:  Insert: {u ∈ J_(r(j))| τ(u) > T − ρ} at r(j); (Step 708)  8:  InsertToShortTermGroup: {u ε J_(r(j)) | τ(u) ≦ T − ρ}; (Step 709)  9:  r(j)

 r(j) + T; (Step710) 10: end if

The English Protocol B may be expressed in the Korean Protocol as shown in table 5.

TABLE 5 1.

2.

703) 3.

4.

5.

6.

7.

8.

10.

11.

The Protocol B presented in tables 4 and 5 and FIG. 7 can be described briefly as follows.

First, if the current time matches r(j) at step 702, the KDC starts the process. The KDC sorts the users departing from {circumflex over (ω)}_(j) in the current interval into D_(r(j)) and the remained users into R_(r(j)) ^(i) at step 703 of FIG. 7. The KDC disjoins the users from D_(r(j)) at step 704 of FIG. 7.

The KDC includes the users entering during the current interval in J_(r(j)) at step 705 of FIG. 7. The KDC updates sets of all of the sets of users at step 706 of FIG. 7.

The KDC deletes the departed users from the set σ of short term users at step 707 of FIG. 7. The KDC sorts the users included in J_(r(j)) whose times included in the group is equal to or longer than a cycle {circumflex over (b)} into appropriate partitions of {circumflex over (ω)}₀, {circumflex over (ω)}₁, . . . , {circumflex over (ω)}_({circumflex over (b)}−1) FIG. 7. At the same time, the KDC sorts the users whose times included in the group is shorter than the cycle {circumflex over (b)} into σ_(s).

The processing procedure of protocol B according to the second embodiment of the present invention is depicted into a flowchart of FIG. 8.

Referring to FIG. 8, the KDC waits until the rekey time arrives at step 801. The KDC sorts the users departing from the current subgroup into D and the remained users into R at step 802. The KDC deletes the departed users D at step 803.

The KDC sorts the users entered the group in the current rekey interval into J at step 804. The KDC updates the group key and sorts the users whose predicted departure time is equal to or longer than a predetermined period (e.g. one cycle) into subgroups per same departure time at step 805. That is, the users are sorted into the subgroup remained after dividing the departure time with the total number of subgroups. In this case, if a new user J is sorted into a group, the KDC uses the Insert Function which is described later.

The KDC sorts the users whose departure prediction time is shorter than a predetermined period (e.g. one cycle) among the users of J into a short-term group and, for this purpose, the KDC uses a short insertion function (InsertToShortTermGroup) which is described later.

The KDC moves the current rekey time and subgroup to the next duration at step 807. That is, the KDC adds 1 to the update time to move to the next interval and the next update time to the subgroup remained after diving the next updated time with the total number of subgroups.

The protocol B sorts the short term users into group w_(s) which changes at every ρ. Accordingly, the backward secrecy is maintained for the users.

A description is made of the algorithm for the insert function used in the protocols A and B.

The English protocol for the insert function is shown in table 6 and depicted into a flowchart as shown in FIG. 9.

TABLE 6  1: Function Insert: users ω_(insert) at r(j) (step 901)  2: k ← k_(σj) (FIG. 902)  3: Replace key nodes with new ones: k → k′ (step 903)  4: Encrypt the new k′ with all of its children keys; (step 904)  5: Multicast the encrypted k′; (step 905)  6: if k = TEK then goto 11; (step 906)  7: else (arrow to no from step 906)  8: k ← k's parent (step 907)  9: go to 3; 10: end if(step 906) 11: for all ul ∈ ω_(insert) do (step 908, 909) 12: Position u into σ_(d(u)mod b) based on the current partition P; (step 910) 13: send a keypath message* to σ_(d(u)mod b): Enc (P_(σ) _(d(u)mod) _(b) , k(u)); (step 911) 14: σ_(d(u)mod b) ← σ_(d(u)mod b) ∪{u} (step 912) 15: end for (step 908) 16: end Function (step 913)

In table 6, the key path P_(σ) _(j) denotes the path of the group key in the subgroup k_(σ) _(j) on the tree structure. If a key path message is transmitted, this means that the keys on the key path are encrypted with the sub-keys for transmission.

For example, transmitting a key path to the user 101 in FIG. 3 has the meaning as follows. First, the key path is gk->k0->k00->IK and, if a key path message is transmitted, this means that the following message are transmitted.

KDC->Users: M1=Enc(gk, k0)

KDC->Users: M2=Enc(k0, k00)

KDC->Users: M3=Enc(k00,IK) (IK of user 101 of FIG. 3)

Meanwhile, the Korean protocol corresponding to the English insert function is shown in table 7.

TABLE 7

1:

2: k ← k_(σ) _(j) ; (

 902) 3:

4:

5:

6:

7:

8: k ← k's parent;(

 907) 9:

10:

11:

12:

13:

14: σ_(d(u)mod b) ← σ_(d(u)mod b) ∪ {u}; (

 912) 15:

16:

The procedure for the KDC to execute the insert function is depicted as shown in FIG. 10.

First, the KDC encrypts all of the keys on the key path to the group key in the subgroup key corresponding to the current subgroup on the key tree at step 1001. The keys encrypt the children keys, and the encrypted keys are concatenated.

The KDC sorts the users having the same departure time into a subgroup at step 1002. That is, the KDC sorts a user into the subgroup corresponding to the value of remainder of dividing the departure time of the user by total number of subgroups.

A description is made of the algorithm of the short insert function (InsertToShortTermGroup) for use in protocol B.

The English protocol of the short insert function (InsertToShortTermGroup) is shown in table 8 and depicted into a flowchart as shown in FIG. 11.

TABLE 8  1: Function InsertToShortTermGroup: users set ω (Step 1101)  2: Update k_(σ) _(s) to k_(σ) _(s) ^(′) (Step 1102)  3: for all u ∈ σ_(s) users do (Step 1103)  4:  Send a key k_(σ) _(s) ^(′) to u: Enc(k_(σ) ₂ ^(′), k(u)); (Step 1103)  5: end for (Step 1103)  6: Multicast Enc(GK, k_(σ) ₂ ^(′)); (Step 1104)  7: σ_(s) ← σ_(s) ∪ ω; (Step 1105)  8: for all u ∈ σ users do (Step 1106, 1107)  9:   Send  a  key  path  messages  to  u:  Enc(P_(k_(σ_(s))^(′)), k(u)); (Step  1108) 10: end for (Step 1106, 1107) 11: end function (Step 1109)

The Korean protocol of the short insert function (InsertToShortTermGroup) is shown in table 9.

TABLE 9 1:

2:

3:

4:

5:

6:

7:

8:

9:

10:

11:

The procedure for the KDC to execute the short insert function

(InsertToShortTermGroup) is shown in FIG. 12.

First, the KDC updates the subgroup key of the short departure group (Short-Term group) and sends the undated subgroup key to the users. That is, the KDC encrypts the updated subgroup keys with the individual keys of the corresponding users remained in the short departure groups. The KDC sends the short departure group users the subgroup keys encrypted per user in series.

The KDC sends the updated group key to the user at step 1202. That is, the updated group key is encrypted with the subgroup key of the updated short departure group and sent to the remained short departure group users.

The KDC sends the encrypted updated group key and the encrypted updated subgroup key of the short departure group to the users entered the short departure group newly at step 1203. That is, the KDC encrypts the updated group key with the subgroup key of the updated short departure group, encrypt the subgroup key of the updated short departure group with the individual key of the newly entered users, and sends the encrypted subgroup key in series.

FIG. 13 is a flowchart illustrating the procedure for the KDC to execute Protocol A and Protocol B according to an embodiment of the present invention.

First, the KDC checks the new entry user group which is newly entering the multicast data reception group at step S1305. The KDC receives the group entry time and the group departure time information from the new entry users at step S1310.

Then the KDC sorts the users departed in the previous interval right before into a departed user group and the remained users into a remained user group at step S1315 and deletes the departed user group at step S1320.

The KDC determines whether the currently running protocol is Protocol A or Protocol B at step S1327. If Protocol A, the KDC includes the newly entered users in remained user group based on the group departure time information at step S1340.

Otherwise if protocol B, the KDC determines whether the new entry user departs the group in a predetermined interval at step S1330. If the new entry user does not depart the group in the predetermined interval, the procedure goes to step S1340. Otherwise if the new entry user departs the group in the predetermined interval, the KDC includes the corresponding user in the short departure group at step S1335.

As described above, the protocol B includes the new entry user in the remained user group at step 1340 or the short departure group at step 1335 in consideration of both the group departure time information and departure interval.

FIG. 14 is a block diagram illustrating a configuration of the KDC according to an embodiment of the present invention. As shown in FIG. 14, the KDC of the present invention includes an interface unit 1410, a storage unit 1420, and a control unit 1430.

The interface unit 1410 performs wired/wireless communication with other entities located on the network. In an embodiment of the present invention, the interface unit receives the group entry time and group departure time information from the user entering a certain group including at least one subgroup and sends the information to the control unit 1430.

The storage unit 1420 is responsible for storing the program and data necessary for the operation of the KDC according to an embodiment of the present invention. According to an embodiment of the present invention, the storage unit 1420 may store a program sorting the users having the same group departure time into the same group and, if key update is required, updating the keys of the group in a batch manner.

The control unit 1430 controls the overall operation of the components of the KDC according to an embodiment of the present invention. Particularly, the control unit 1430 may control the procedure of sorting the users having the same group departure time into the same group and updating, when key update is required, the keys of the group in a batch manner. The key management unit 1431 controls the procedure of updating, when a certain user departs from the group, the key which the user knows and sending the updated key to the other subgroup users. The key management unit 1431 controls the procedure of sending, when a certain user joins the group newly, the group key and related keys to the new subgroup joiner sorted into the group by the group manager 1432.

The group manager 1432 sorts the users entering the group newly into groups using the group entry time and group departure time information received through the interface unit 1410. In more detail, the group management unit 1432 sorts the users into the departed user group and the remained user group, deletes the departed user group, and includes the new entry user in the remained user group according to the departure time information. In this case, the group management unit 1432 may include the new entry user in the remained user group according to the remainder value obtained dividing the group departure time of the new entry user by a number of subgroups.

The group management unit 1432 determines whether the user entering the group newly is the user to depart from the group in a predetermined time and, if so, includes the user in the short term departure group and, otherwise, in a remained user group according to the group departure time information. Returning to the description on the control unit 1430, the control unit 1430 may send the group key or subgroup key to the user entering or departing the group. In more detail, the control unit 1430 sends the entry user the group key of the group and the subgroup key of the subgroup in which the entry user is included. That is, if an entry user is detected, the controller 1430 does not need to perform any key update process but send the user the keys (group key and subgroup key) for use in decrypting the encrypted multicast data.

Meanwhile, if a group departing user is detected, the control unit 1430 updates the subgroup key and group key of the subgroup in which the group departing user is included and sends the updated keys to other users remained in the group.

Although the description is directed to the case where the control unit 1430, key management group 1431, and group management unit 1432 are implemented as independent blocks responsible for different functions, it is just for the explanation convenience but not limitation to such functional split. For example, the functions in charge of the group management unit 1432 may be executed by the control unit 1430 in itself.

Hereinafter, descriptions are made of the key assignment and group sorting procedure based on Protocol A and Protocol B according to an embodiment of the present invention with reference to FIG. 15.

FIG. 15 shows an algorithm in a tree structure. The users are represented by ellipses each having two natural values separated with a hyphen (-). Here, the value at the left side of the hyphen denotes the group entry time and the right side the group departure time. If the two natural values are expressed by ε-δ, the group entry time of the user is in the range of r(ε)-ρ<t≦r(ε) and the group departure time is in the range of r(δ)-ρ<t≦r(δ). Accordingly, the entry and departure processing times are r(ε) and r(δ).

The key topology is updated periodically, and subgroups are arranged on the bottom layer of the tree, each subgroup having a subgroup key. The group key is at the top of the tree. The group key is managed by a key layer and, when it is transmitted for security, encrypted with the key outside one layer using the tree-based key management method as in the logical key hierarchy (LKH) as described above.

First, a description is made of the protocol A according to an embodiment of the present invention with reference to FIG. 15.

FIG. 15 shows the principle of the protocol A when the number of partitions is 4. J_(r(5)) denotes the users entering the group newly at a time between r(5)-ρ and r(5), the second group updates its keys in the current interval in protocol A of FIG. 15, and all of the users departing from the group are included in the partition of the second group.

The three users in J_(r(5)) are arranged on the surface of the disk according to their departure times. In detail, the users 5-8 and 5-12 are the users having the departure times in the range of nT-ρ˜nT (n is positive integer) and, if the number of partitions is 4, the remainder obtained by dividing group departure time 8 and 12 by 4 (number of partitions) is 0 and thus the users are included in the partition σ₁ as the first group. The user 5-19 has the departure time in the range of nT+2ρ˜nT+3ρ (n is positive integer) and the remainder obtained by dividing the group departure time 19 by 4 (number of partition) is 3 and thus the corresponding user is included in σ₃ as the second group.

The following message is transmitted. Since the user included in σ₁ departs, three keys, i.e. k_(σ) ₁ , k₀, GK, have to be updated. Accordingly, the KDC sends the following message to the users.

Enc(GK′,k₀)∥Enc(GK′,k₁)∥Enc(k′₀,k′_(σ) ₁ )∥Enc(k′_(σ) ₁ ,k(u₍₄₋₉₎))

Also, since it is necessary to deliver the key paths to the newly entered users 5-8, 5-12, and 5-19, the following messages are generated additionally.

-   -   To user 5-8: Enc(GK′,k′₀)∥Enc(k′₀,k_(σ) ₀ )∥Enc(k_(σ) ₀         ,k(u₍₅₋₈₎))     -   To user 5-12: Enc(GK′,k′₀)∥Enc(k′₀,k_(σ) ₀ )∥Enc(k_(σ) ₀         ,k(u₍₅₋₁₂₎))     -   To user 5-19: Enc(GK′,k₁)∥Enc(k₁,k_(σ) ₃ )∥Enc(k_(σ) ₃         ,k(u₍₅₋₁₉₎))

Summarizing the above description, total 14 messages are generated.

Next, a description is made of the protocol B according to an embodiment of the present invention with reference to FIG. 15.

FIG. 15 also shows the principle of the protocol B when the number of partitions is 4 like the Protocol A. J_(r(5)) denotes the users entering the group newly at a time between r(5)-ρ and r(5). In Protocol B of FIG. 15, the second and fifth groups update their keys in the current interval, and all of the users departing from the groups are included in the partitions of the part colored by red. The users in J₍₅₎ are arranged on the disk surface according to their departure times. In detail, the user 5-8 has its departure time in an interval (T) among the users entering the group J₍₅₎ newly and is included in the partition σ_(s) right below the group key (GK) by the short insert function (InsertToShortTermGroup) of protocol B. The user 5-12 has its departure time greater than one interval among the users entering the group J₍₅₎ newly, the group departure time is in the range of nT˜ρ˜nT (n is positive integer) and the remainder obtained by dividing group departure time 12 by 4 (number of partitions) is 0 and thus is included in the partition σ₀. The user 5-19 is the user having its group departure time in the range of nT+2ρ˜nT+3ρ (n is non-negative integer) and the remainder obtained by dividing the group departure time 19 by 4 (number of partitions) is 3 and thus included in the partition σ₃.

The KDC sends the following messages to the users. Since the suer in σ₁ departs, the keys k_(σ) ₁ , k₀, k_(σ) ₃ , GK have to be updated. Accordingly, the following message are sendt.

-   -   Enc(GK′,k′₀)∥Enc(GK′,k₁)∥Enc(k′₀,k_(σ) ₀ )∥Enc(K′₀,k′_(σ) ₁         )∥Enc(K′_(σ) ₁ ,k(u₍₄₋₉₎))

Also, since it is necessary to deliver the key paths to the newly entered users 5-8, 5-12, and 5-19, the following message are generated additionally.

-   -   To user 5-8: Enc(GK′,k′₂)∥Enc(k′_(s),k(u₍₅₋₈₎))     -   To user 5-12: Enc(GK′,k′₀)∥Enc(k′₀,k_(σ) ₀ )∥Enc(kσ₀,k(u₍₅₋₁₂₎))     -   To user 5-19: Enc(GK′,k₁)∥Enc(k₁,k_(σ) ₃ )∥Enc(k_(σ) ₃         ,k(u₍₅₋₁₉₎))

Summarizing the above description, total 15 messages are generated.

The batch key update method, apparatus, and system according to an embodiment of the present invention is capable of decreasing the cost of storing keys, removing key tree unbalance, and reducing the communication indirect costs in key updating process, resulting in improvement of batch key update efficiency.

Although preferred embodiments of the invention have been described using specific terms, the specification and drawings are to be regarded in an illustrative rather than a restrictive sense in order to help understand the present invention. It is obvious to those skilled in the art that various modifications and changes can be made thereto without departing from the broader spirit and scope of the invention. 

1. A key update method of encrypting multicast data in a wireless communication system, the method comprising: receiving information on group entry times and group entry times of users entering newly a certain group including at least one subgroup; sorting the users into the at least one subgroup based on the group entry and departure times; sending the users a group key of the group and subgroup keys of the corresponding subgroups respectively; and updating, when a user departs from the group, the subgroup key of the subgroup from which the user departs and the group key and transmitting the updated subgroup key and group key to the users remained in the group.
 2. The method of claim 1, wherein the sorting of the users comprises: sorting the users into a departed user group and a remained user group and deleting the departed user group; and including the newly entering user in the remained user group based on the group departure time.
 3. The method of claim 2, wherein the including of the newly entering user comprises including the newly entering the user in the remained user group according to a remainder value obtained by diving the group departure time of the newly entering user by a number of the subgroups.
 4. The method of claim 2, wherein the including of the newly entering users comprises: determining whether the newly entering user is the user to depart from the group in a predetermined time; and including, when the newly entering user is the user to depart from the group in the predetermined time, the newly entering user in a short term departure group.
 5. The method of claim 4, wherein the including of the newly entering users comprises including, when the newly entering user is not the user to depart from the group in the predetermined time, the newly entering user in the remained user group.
 6. An apparatus of updating and delivering keys encrypting multicast data in a wireless communication system, the apparatus comprising: an interface unit which receives information on group entry times and group entry times of users entering newly a certain group including at least one subgroup; and a control unit which sorts the users into the at least one subgroup based on the group entry and departure times, sends the users a group key of the group and subgroup keys of the corresponding subgroups respectively, and updates, when a user departs from the group, the subgroup key of the subgroup from which the user departs and the group key and transmitting the updated subgroup key and group key to the users remained in the group.
 7. The apparatus of claim 6, wherein the control unit which sorts the users into a departed user group and a remained user group, deletes the departed user group, and includes the newly entering user in the remained user group based on the group departure time.
 8. The apparatus of claim 7, wherein the control unit includes the newly entering the user in the remained user group according to a remainder value obtained by diving the group departure time of the newly entering user by a number of the subgroups.
 9. The apparatus of claim 6, wherein the control unit determines whether the newly entering user is the user to depart from the group in a predetermined time and includes, when the newly entering user is the user to depart from the group in the predetermined time, the newly entering user in a short term departure group.
 10. The apparatus of claim 9, wherein the control unit includes, when the newly entering user is not the user to depart from the group in the predetermined time, the newly entering user in the remained user group. 